The Young-Eidson Algorithm: Applications and Extensions

نویسندگان

  • A. Hadjidimos
  • D. Noutsos
چکیده

Ahstract In this paper it is assumed that the point (or block) Jacobi manix. B associated with the matrix A is weakly 2-cyclic consistently ordered with complex, in general, eigen-value spectrum, a(B), lying in the interior of the infinite unit strip. It is then our objec~ live to apply and ex.tend the Young-Eidson algorithm in order to determine the real optimum relaxation factor in the following two cases: i) In the case of the Successive Overrelaxation (SOR) matrix associated with A when a(B) lies in a "bow-tie" region and ti) In the case of the Symmetric SOR (SSOR) matrix associated with A. It is noted that as a by-product of (ti) above both the relaxation factor for the SSOR matrix corresponding to a "bow-tie" spectrum a(8) and the optimum pairs of the relaxation factors for the Unsymmetric SOR (USSOR) matrix associated with A are also obtained.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version

Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...

متن کامل

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

متن کامل

A Clustering Approach by SSPCO Optimization Algorithm Based on Chaotic Initial Population

Assigning a set of objects to groups such that objects in one group or cluster are more similar to each other than the other clusters’ objects is the main task of clustering analysis. SSPCO optimization algorithm is anew optimization algorithm that is inspired by the behavior of a type of bird called see-see partridge. One of the things that smart algorithms are applied to solve is the problem ...

متن کامل

Some new extensions of Hardy`s inequality

In this study, by a non-negative homogeneous kernel k we prove some extensions of Hardy's inequalityin two and three dimensions

متن کامل

A reactive bone route algorithm for solving the traveling salesman problem

The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013